Double Mover–Stayer model on customer switching in telecommunications industry

Customer acquisition and customer retention are the most important challenges in the increasingly competitive telecommunications industry. Traditional studies of customer switching always assume that customers are homogeneous, and thus that model customer switching behavior follows a Markov formulation. However, this postulation is obviously inappropriate in most instances. Blumen et al. (Cornell Studies of Industrial and Labor Relations, Cornell University Press, Ithaca, NY, 1955) developed the Mover–Stayer (MS) model, a generalization of the Markov chain model, to relax the requirement of homogeneity and allow the presence of heterogeneity with two different types of individuals—“stayers,” who purchase the same kinds of products or services throughout the entire observation period; and “movers,” who look for variety in products or services over time. There are two purpose of this article. First, we extend the MS model to a Double Mover‐Stayer (DMS) model by assuming the existence of three types of individuals in the market: (1) stable and loyal customers, who have stable usage within the same company; (2) instable but loyal customers, whose usage varies within the same company over time; and (3) disloyal customers, who switch from one company to another to seek for new experiences or/and benefits. We also propose an estimation method for the DMS model. Second, we apply the DMS model to telecommunications data and demonstrate how it can be used for pattern identification, hidden knowledge discovery, and decision making. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.     

新中国60年国防战略的历史演变

新中国成立60年来,国防战略先后做过4次重大调整.每一次调整既始终贯彻了积极防御这一新中国国防战略的本质要素,又与当时中国国家安全环境以及国家发展战略密切相关,有着明显的时代特征,显示了新中国国防战略的日臻成熟.     

Single machine parallel batch scheduling subject to precedence constraints

We consider the single machine parallel batch scheduling problems to minimize makespan and total completion time, respectively, under precedence relations. The complexities of these two problems are reported as open in the literature. In this paper, we settle these open questions by showing that both problems are strongly NP‐hard, even when the precedence relations are chains. When the processing times of jobs are directly agreeable or inversely agreeable with the precedence relations, there is an O(n²) time algorithm to minimize the makespan. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Parametric inference for component distributions from lifetimes of systems with dependent components

In system reliability analysis, for an n ‐component system, the estimation of the performance of the components in the system is not straightforward in practice, especially when the components are dependent. Here, by assuming the n components in the system to be identically distributed with a common distribution belonging to a scale‐family and the dependence structure between the components being known, we discuss the estimation of the lifetime distributions of the components in the system based on the lifetimes of systems with the same structure. We develop a general framework for inference on the scale parameter of the component lifetime distribution. Specifically, the method of moments estimator (MME) and the maximum likelihood estimator (MLE) are derived for the scale parameter, and the conditions for the existence of the MLE are also discussed. The asymptotic confidence intervals for the scale parameter are also developed based on the MME and the MLE. General simulation procedures for the system lifetime under this model are described. Finally, some examples of two‐ and three‐component systems are presented to illustrate all the inferential procedures developed here. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于PXA255的信息支持设备设计与实现

论述了基于PXA255嵌入式系统的手持式辅助维修系统信息支持设备的硬件结构和软件结构的设计,在W indows CE.NET 4.2的基础上,利用embedded V isual C 4.0设计了与硬件设备配套使用的软件部分,使该信息支持设备扩展了数字万用表/示波器、无线数传、CDMA、GPS和身份验证等多种功能。     

Survivability assessment of spacecraft impacted by orbit debris

To help optimize the spacecraft design and reduce the risk of spacecraft mission failure, a new approach to assess the survivability of spacecraft in orbit is presented here, including the following three steps:1) Sensitivity Analysis of spacecraft. A new sensitivity analysis method, a ray method based on virtual outer wall, is presented here. Using rays to simulate the debris cloud can effectively address the component shadowing issues. 2) Component Vulnerability analysis of spacecraft. A function"Component functional reduction degree — Component physical damage degree"is provided here to clearly describe the component functional reduction. 3) System-level Survivability Assessment of spacecraft. A new method based on expert knowledge reasoning, instead of traditional artificial failure tree method, is presented here to greatly improve the efficiency and accuracy of calculation.     

20世纪六七十年代中国战备的回顾与思考

20世纪六七十年代,新中国面对严峻的国家安全形势,曾进行了一场大规模的战备.这次战备以"早打、大打、打核战争"为指导思想,将战备工作在一个相当长的时期内摆在全党、全军乃至全国各项工作的中心地位,并制约国家各项工作的安排和开展,与一般意义上的战备相比显示出特殊的复杂性.因而,这一时期的战备备受争议,可谓众说纷纭、褒贬不一.     

Combined variance reduction techniques in fully sequential selection procedures

In the past several decades, many ranking‐and‐selection (R&S) procedures have been developed to select the best simulated system with the largest (or smallest) mean performance measure from a finite number of alternatives. A major issue to address in these R&S problems is to balance the trade‐off between the effectiveness (ie, making a correct selection with a high probability) and the efficiency (ie, using a small total number of observations). In this paper, we take a frequentist's point of view by setting a predetermined probability of correct selection while trying to reduce the total sample size, that is, to improve the efficiency but also maintain the effectiveness. In particular, in order to achieve this goal, we investigate combining various variance reduction techniques into the fully sequential framework, resulting in different R&S procedures with either finite‐time or asymptotic statistical validity. Extensive numerical experiments show great improvement in the efficiency of our proposed procedures as compared with several existing procedures.